Matroid Polytopes and their Volumes

نویسندگان

  • Federico Ardila
  • Carolina Benedetti
  • Jeffrey Doker
چکیده

We express the matroid polytope PM of a matroid M as a signed Minkowski sum of simplices, and obtain a formula for the volume of PM . This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the Grassmannian Grk,n. We then derive analogous results for the independent set polytope and the associated flag matroid polytope of M . Our proofs are based on a natural extension of Postnikov’s theory of generalized permutohedra. Résumé. On exprime le polytope matroı̈de PM d’un matroı̈de M comme somme signée de Minkowski de simplices, et on obtient une formule pour le volume de PM . Ceci donne une expression combinatoire pour le degré d’une clôture d’orbite de tore dans la Grassmannienne Grk,n. Ensuite, on deduit des résultats analogues pour le polytope ensemble indépendant et pour le polytope matroı̈de drapeau associé a M . Nos preuves sont fondées sur une extension naturelle de la théorie de Postnikov de permutoèdres généralisés.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alcoved Polytopes, I

The aim of this paper is to initiate the study of alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hyper-simplices. We compare two constructions of triangulations of hypersimplices due to Stanley and Sturmfels and explain them in terms of alcoved polytopes. We study triangulations ...

متن کامل

ar X iv : m at h . C O / 0 50 12 46 v 1 1 6 Ja n 20 05 ALCOVED POLYTOPES

The aim of this paper is to initiate the study of alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hyper-simplices. We compare two constructions of triangulations of hypersimplices due to Stanley and Sturmfels and explain them in terms of alcoved polytopes. We study triangulations ...

متن کامل

Ehrhart Polynomials of Matroid Polytopes and Polymatroids

We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial time. The proof relies on the geometry of these polytopes as well as a new refined analysis of the evaluation of Todd polynomials. In the second half we discuss...

متن کامل

Symmetric matroid polytopes and their generation

The study of polyhedra within the framework of oriented matroids has become a natural approach. Methods for enumerating combinatorial types of convex polytopes inductively within the Euclidean setting alone have not been established. In contrast, the oriented matroid concept allows one to generate matroid polytopes inductively. Matroid polytopes, when not interesting in their own right as topol...

متن کامل

Flag enumerations of matroid base polytopes

In this paper, we study flag structures of matroid base polytopes. We describe faces of matroid base polytopes in terms of matroid data, and give conditions for hyperplane splits of matroid base polytopes. Also, we show how the cd-index of a polytope can be expressed when a polytope is split by a hyperplane, and apply these to the cd-index of a matroid base polytope of a rank 2 matroid.

متن کامل

Lattice Path Matroid Polytopes

Fix two lattice paths P and Q from (0, 0) to (m, r) that use East and North steps with P never going above Q. Bonin et al. in [1] show that the lattice paths that go from (0, 0) to (m, r) and remain bounded by P and Q can be identified with the bases of a particular type of transversal matroid, which we call it a lattice path matroid. In this paper, we consider properties of lattice path matroi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2010